Some Improvements on Multipartite Table Methods
نویسندگان
چکیده
This paper presents an unified view of most previous table-lookup-andaddition methods: bipartite tables, SBTM, STAM and multipartite method. This new definition allows a more accurate computation of the error entailed by these methods. Being more general, it also allows an exhaustive design space exploration which has been implemented, and leads to tables smaller than previously published ones by up to 50%. These tables have also been synthesised for Virtex FPGAs, and the paper discusses some results of this synthesis.
منابع مشابه
Constructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملMultipartite Tables in JBits for the Evaluation of Functions on FPGAs
This paper presents the implementation, on Virtex FPGAs, of a core generator for arbitrary numeric functions in fixed-point format. The cores use the state-of-theart multipartite table method, which allows input and output precisions in the range of 8 to 24 bits on current Virtex chips. The implementation uses the JBits API to embed elaborate optimisation techniques in the description of the ha...
متن کاملUnsupervised Keyphrase Extraction with Multipartite Graphs
We propose an unsupervised keyphrase extraction model that encodes topical information within a multipartite graph structure. Our model represents keyphrase candidates and topics in a single graph and exploits their mutually reinforcing relationship to improve candidate ranking. We further introduce a novel mechanism to incorporate keyphrase selection preferences into the model. Experiments con...
متن کاملContinuous-variable multipartite unlockable bound entangled Gaussian states
We investigate continuous-variable (CV) multipartite unlockable bound entangled states. Comparing with the qubit multipartite unlockable bound entangled states, CV multipartite unlockable bound entangled states present some new and different properties. CV multipartite unlockable bound entangled states may serve as a useful quantum resource for new multiparty communication schemes. The experime...
متن کاملMultipartite Moore Digraphs
We derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, assuming that every vertex of a given partite set is adjacent to the same number of vertices (δ) in each of the other independent sets. We determine when a Moore multipartite digraph is weakly distanceregular. Within this framework, some necessary conditions for the existence of a Moore r-parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001